Minimum Cost Matching for Autonomous Carsharing

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimum Cost Matching for Autonomous Carsharing

Carsharing programs provide an alternative to private vehicle ownership. Combining carsharing programs with autonomous vehicles would improve user access to vehicles thereby removing one of the main challenges to widescale adoption of these programs. While the ability to easily move cars to meet demand would be significant for carsharing programs, if implemented incorrectly it could lead to wor...

متن کامل

Scheduling of Multiple Autonomous Guided Vehicles for an Assembly Line Using Minimum Cost Network Flow

This paper proposed a parallel automated assembly line system to produce multiple products having multiple autonomous guided vehicles (AGVs). Several assembly lines are configured to produce multiple products in which the technologies of machines are shared among the assembly lines when required. The transportation between the stations in an assembly line (intra assembly line) and among station...

متن کامل

Low Cost UAV-based Remote Sensing for Autonomous Wildlife Monitoring

In recent years, developments in unmanned aerial vehicles, lightweight on-board computers, and low-cost thermal imaging sensors offer a new opportunity for wildlife monitoring. In contrast with traditional methods now surveying endangered species to obtain population and location has become more cost-effective and least time-consuming. In this paper, a low-cost UAV-based remote sensing platform...

متن کامل

Minimum Cost Perfect Matching with Delays for Two Sources

We study a version of the online min-cost perfect matching with delays (MPMD) problem recently introduced by Emek et al. (STOC 2016). In this problem, requests arrive in a continuous time online fashion and should be matched to each other. Each request emerges from one out of n sources, with metric inter-source distances. The algorithm is allowed to delay the matching of requests, but with a co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IFAC-PapersOnLine

سال: 2016

ISSN: 2405-8963

DOI: 10.1016/j.ifacol.2016.07.757